Stratiied Random Walks on the N-cube
نویسنده
چکیده
In this paper we present a method for analyzing a general class of ramdom walks on the n-cube (and certain subgraphs of it). These walks all have the property that the transition probabilities depend only on the level of the point the walk is at. For these walks, we derive sharp bounds on their mixing rates, i.e., the number of steps required to guarantee that the resulting distribution is close to the (uniform) stationary distribution.
منابع مشابه
Stratiied Random Walks on the N-cube
In this paper we present a method for analyzing a general class of ramdom walks on the n cube and certain subgraphs of it These walks all have the property that the transition probabilities depend only on the level of the point the walk is at For these walks we derive sharp bounds on their mixing rates i e the number of steps required to guarantee that the resulting distribution is close to the...
متن کاملOn mixing times for stratified walks on the d-cube
Using the electric and coupling approaches, we derive a series of results concerning the mixing times for the stratified random walk on the d-cube, inspired in the results of Chung and Graham (1997) Stratified random walks on the n-cube. Random Structures and Algorithms, 11,199-222.
متن کاملStratified random walks on the n-cube
In this paper we present a method for analyzing a general class of random Ž . walks on the n-cube and certain subgraphs of it . These walks all have the property that the transition probabilities depend only on the level of the point at which the walk is. For these walks, we derive sharp bounds on their mixing rates, i.e., the number of steps required to Ž . guarantee that the resulting distrib...
متن کاملDynamic Geometric Graph Processes: Adjacency Operator Approach
The d-dimensional unit cube [0, 1] is discretized to create a collection V of vertices used to define geometric graphs. Each subset of V is uniquely associated with a geometric graph. Defining a dynamic random walk on the subsets of V induces a walk on the collection of geometric graphs in the discretized cube. These walks naturally model addition-deletion networks and can be visualized as walk...
متن کاملRandom random walks on Z d 2
We consider random walks on classes of graphs de®ned on the ddimensional binary cube Zd2 by placing edges on n randomly chosen parallel classes of vectors. The mixing time of a graph is the number of steps of a random walk before the walk forgets where it started, and reaches a random location. In this paper we resolve a question of Diaconis by ®nding exact expressions for this mixing time that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996